Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
791	Decentralized Generic Rigidity Evaluation in Interconnected Systems Ryan K. Williams, Andrea Gasparri, Attilio Priolo, and Gaurav S. Sukhatme Abstract— In this paper, we consider the problem of evaluating the generic ( Add to Reading List Source URL: robotics.usc.edu Language: English - Date: 2014-04-15 18:21:08 Combinatorial game theory Computational complexity theory Pebble game Applied mathematics Structural rigidity Graph Mathematics Theoretical computer science Graph theory
792	Energy Aware Algorithm Design via Probabilistic Computing: From Algorithms and Models to Moore’s Law and Novel (Semiconductor)Devices ∗ [Extended Abstract] Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2012-08-15 22:22:20 Probabilistic complexity theory Analysis of algorithms Randomized algorithm RL Algorithm NL PP Lateral computing Theoretical computer science Computational complexity theory Applied mathematics
793	Maejo Int. J. Sci. Technol. 2015, 9(01), Maejo International Journal of Science and Technology ISSNAvailable online at www.mijst.mju.ac.th Add to Reading List Source URL: www.mijst.mju.ac.th Language: English - Date: 2015-04-02 23:15:13 Containers Operations research Shipping containers NP-complete problems Discrete geometry Packing problem Containerization Knapsack problem Wooden box Theoretical computer science Computational complexity theory Mathematics
794	Table of EMICs (Earth System Models of Intermediate Complexity) Edited by: Martin Claussen Potsdam Institute for Climate Impact Research PO Box Add to Reading List Source URL: www.pik-potsdam.de Language: English - Date: 2005-06-28 04:27:04 Climate history Global warming Climate forcing Computational science Global climate model Climate model Anders Levermann Heinrich event Dynamic global vegetation model Atmospheric sciences Climatology Earth
795	Generating counterexamples for quantitative safety specifications in probabilistic B Ukachukwu Ndukwu1 Department of Computing, Macquarie University, NSW 2109 Sydney, Australia. Abstract Add to Reading List Source URL: web.science.mq.edu.au Language: English - Date: 2010-04-30 06:17:08 Probabilistic complexity theory Complexity classes Probabilistic Turing machine Turing machine PP NL Predicate transformer semantics IP Model checking Theoretical computer science Computational complexity theory Applied mathematics
796	Electronic Notes in Theoretical Computer ScienceURL: http://www.elsevier.nl/locate/entcs/volume45.html 31 pages A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Rep Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2002-09-12 20:15:55 Complexity classes Computability theory Models of computation Probabilistic complexity theory PP IP Oracle machine NP P Theoretical computer science Computational complexity theory Applied mathematics
797	Curriculum Vitæ (abridged) Luke Mathieson BSc BCompSc(Hons1) PGDipHEd MHEd PhD(Dunelm) Personal Details Add to Reading List Source URL: comp.mq.edu.au Language: English - Date: 2013-12-01 23:03:08 Parameterized complexity International Colloquium on Automata Languages and Programming Algorithm Symposium on Theoretical Aspects of Computer Science Michael Fellows Theoretical computer science Applied mathematics Computational complexity theory
798	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory
799	Fast Algorithms for Computing Tree LCS Shay Mozes1 Dekel Tsur2 Oren Weimann3 Michal Ziv-Ukelson2 1 Brown University Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-17 10:13:00 Analysis of algorithms Time complexity Tree Spanning tree NP-complete problems Theoretical computer science Computational complexity theory Applied mathematics
800	Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern Ian Harrower School of Computer Science University of Waterloo Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2005-07-08 16:21:37 Approximation algorithm Computational complexity theory Substring Computing Hamming distance Optimization problem Mathematics Theoretical computer science String

UPDATE